A note on an L-approach for solving the manufacturer's pallet loading problem

Lagrangean relaxation with clusters and column generation for the manufacturer's pallet loading problem

We consider in this paper a new lagrangean relaxation with clusters for the Manufacturer’s Pallet Loading Problem (MPLP). The relaxation is based on the MPLP formulated as a Maximum Independent Set Problem (MISP) and represented in a conflict graph that can be partitioned in clusters. The edges inter clusters are relaxed in a lagrangean fashion. Computational tests attain the optimality for som...

A Tight Lagrangean Relaxation Bound for the Manufacturer's Pallet Loading Problem

In this study we analyze the performance of a Lagrangean relaxation upper bound for the problem of packing the maximum number of rectangles of sizes (l; w) and (w; l) into a larger rectangle (L;W ) without overlapping. This problem appears in the loading of identical boxes on pallets, namely the manufacturer’s pallet loading problem (MPL), as well as in package design and truck or rail car load...

A Note on a Combined Approach to the Pallet Loading Problem

A Novel Model for Pallet Loading Problem Using Hybrid Optimization

A Pallet is a squared structure used for storage. As it has been produced over five million pallets a year, methodologies that reduce the storage cost are interesting. It is necessary to best allocate the items, which we‟ve used as boxes, to take the best advantage of the storage space. There are many possible allocations for a box on the pallet, and simply solve the problem can take a long tim...

An effective recursive partitioning approach for the packing of identical rectangles in a rectangle

In this work, we deal with the problem of packing (orthogonally and without overlapping) identical rectangles in a rectangle. This problem appears in different logistics settings, such as the loading of boxes on pallets, the arrangements of pallets in trucks and the stowing of cargo in ships. We present a recursive partitioning approach combining improved versions of a recursive five-block heur...